The Localised Bounded $$L^2$$-Curvature Theorem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kirszbraun’s Theorem and Metric Spaces of Bounded Curvature

We generalize Kirszbraun’s extension theorem for Lipschitz maps between (subsets of) euclidean spaces to metric spaces with upper or lower curvature bounds in the sense of A.D. Alexandrov. As a byproduct we develop new tools in the theory of tangent cones of these spaces and obtain new characterization results which may be of independent interest.

متن کامل

The Cost of Bounded Curvature

We study the motion-planning problem for a car-like robot whose turning radius is bounded from below by one and which is allowed to move in the forward direction only (Dubins car). For two robot configurations σ, σ′, let `(σ, σ′) be the shortest bounded-curvature path from σ to σ′. For d > 0, let `(d) be the supremum of `(σ, σ′), over all pairs (σ, σ′) that are at Euclidean distance d. We study...

متن کامل

Bounded-Curvature Path Normalization

We present a new normal form for bounded-curvature paths that admits a combinatorial discription of such paths and a bound on the algebraic complexity of the underlying geometry.

متن کامل

The Bounded Memory Folk Theorem∗

We show that the Folk Theorem holds for n-player discounted repeated game with bounded-memory pure strategies. Our result requires each player’s payoff to be strictly above the pure minmax payoff but requires neither time-dependent strategies, nor public randomization, nor communication. The type of strategies we employ to establish our result turn out to have new features that may be important...

متن کامل

Convex tours of bounded curvature

We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with n vertices. We present an O(m + n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Mathematical Physics

سال: 2019

ISSN: 0010-3616,1432-0916

DOI: 10.1007/s00220-019-03458-9